Minimal reducible bounds for induced-hereditary properties

Semanišin, Gabriel

doi:10.1016/j.disc.2003.11.058

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2007

2017

Publication Types

Select...

Article2

Book1

Relationship

Self Cite1

Independent2

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…k-degenerate graphs were introduced in [8] and they play an important role in the structure of hereditary properties of graphs (see e.g. [9], [10]).…”

Section: Introductionmentioning

confidence: 99%

Some bounds on the generalised total chromatic number of degenerate graphs

Broere

Semani?in

2017

Information Processing Letters

Self Cite

View full text Add to dashboard Cite

The total generalised colourings considered in this paper are colourings of the vertices and of the edges of graphs satisfying the following conditions: • each set of vertices of the graph which receive the same colour induces an m-degenerate graph, • each set of edges of the graph which receive the same colour induces an n-degenerate graph, and • incident elements receive different colours. Bounds for the least number of colours with which this can be done for all k-degenerate graphs are obtained.

show abstract

“…k-degenerate graphs were introduced in [8] and they play an important role in the structure of hereditary properties of graphs (see e.g. [9], [10]).…”

Section: Introductionmentioning

confidence: 99%