Title of article :
Difficult Problems in Threshold Graphs
Author/Authors :
Ortiz Z.، نويسنده , , Carmen and Villanueva-Ilufi، نويسنده , , Mَnica، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2004
Abstract :
A graph G is called a threshold graph if Adj ( x ) ⊆ Adj ( y ) ∪ { y } or Adj ( y ) ⊆ Adj ( x ) ∪ { x } for any pair of vertices x and y of G. In this work we use a structural characterization of threshold graphs for solving difficult problems: enumerating all the maximal independent sets and the chromatic index problem.
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
