On the structure and deficiency of \(k\)-trees with bounded degree

DOI10.1016/j.dam.2015.08.008zbMath1329.05102OpenAlexW1601007368MaRDI QIDQ908291

Mariusz Hałuszczak, Ewa Drgas-Burchardt, Marta Borowiecka-Olszewska

Publication date: 4 February 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.08.008

zbMATH Keywords

\(k\)-treechromatic indexedge colouringdeficiencyconsecutive (interval) colouring

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Further results on the deficiency of graphs ⋮ Consecutive colouring of oriented graphs ⋮ Forbidden structures for planar perfect consecutively colourable graphs ⋮ Cyclic deficiency of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Separating subgraphs in k-trees: Cables and caterpillars
• On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs
• Interval edge-colorings of complete graphs and \(n\)-dimensional cubes
• On the deficiency of bipartite graphs
• Investigation on interval edge-colorings of graphs
• On simple characterizations of k-trees
• Subclasses of \(k\)-trees: characterization and recognition
• The deficiency of a regular graph
• Interval edge-colorings of Cartesian products of graphs I
• Interval edge colorings of some products of graphs
• Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs
• The number of labeled k-trees
• Properties and characterizations of k ‐trees
• Consecutive colorings of the edges of general graphs

This page was built for publication: On the structure and deficiency of \(k\)-trees with bounded degree