پديد آورنده :
نقي زاده، اعظم
عنوان :
رنگ آميزي ليستي منصفانه ي گراف ها
مقطع تحصيلي :
كارشناسي ارشد
گرايش تحصيلي :
رياضي كاربردي
محل تحصيل :
اصفهان: دانشگاه صنعتي اصفهان، دانشكده علوم رياضي
استاد راهنما :
بهناز عمومي
استاد مشاور :
رامين جوادي
واژه نامه :
به فارسي و انگليسي
تاريخ نمايه سازي :
1394/09/15
استاد داور :
عباداله محموديان، غلامرضا اميدي
تاريخ ورود اطلاعات :
1396/10/05
چكيده انگليسي :
Equitable List Coloring of Graphs Azam Naghizadeh Azam Naghizadeh@math iut ac ir September 16 2015 Department of Mathematical Sciences Isfahan University of Technology Isfahan 84156 83111 Iran Supervisor Dr Behnaz Omoomi bomoomi@cc iut ac ir Advisor Dr Ramin Javadi rjavadi@cc iut ac ir 2010 MSC 05C15 Keywords Vertex coloring Equitable coloring Planar graphs Outer planar graphs AbstractIf the vertices of a graph G are colored with k colors such that no adjacent vertices receivethe same color then G has k vertex coloring A list assignment L for a graph G assigns toeach vertex v V G a set L v of allowable colors An L coloring of G is a proper vertexcoloring such that for every v V G the color on v belongs to L v For example whencolors represent time periods and vertices are jobs the list model incorporates restrictionsthat not all time periods are suitable for all jobs A list assignment L for G is k uniform if L v k for all v V G Given a k uniform list assignment L for an n vertex graph G we say that G is equitably L ncolorable if G has an bounded L coloring of G A graph G is equitably list k colorable or kequitably k choosable if G is equitably L colorable whenever L is a k uniform list assignmentfor G Kostochka Pelsmajer and West introduced the list analogue of equitable coloring in 2003 This study investigates equitably k choosable for certain classes of graphs like forests intervalgraphs lessdegenerate graphs series parallel graphs planer and outerplaner graphgs and it
استاد راهنما :
بهناز عمومي
استاد مشاور :
رامين جوادي
استاد داور :
عباداله محموديان، غلامرضا اميدي
