Edge-colouring graphs with bounded local degree sums

DOI10.1016/j.dam.2020.03.044zbMath1440.05098OpenAlexW3014362497MaRDI QIDQ2184694

A. Zorzi, Leandro M. Zatesko, Renato Carmo, André L. P. Guedes

Publication date: 29 May 2020

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

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

zbMATH Keywords

graph algorithmscolouring of hypergraphsvertex degrees

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Total-chromatic number and chromatic index of dually chordal graphs
• On the chromatic index of cographs and join graphs
• The chromatic index of a graph whose core has maximum degree 2
• Some criteria for a graph to be class 1
• Edge-colouring of joins of regular graphs. I
• Decompositions for edge-coloring join graphs and cobipartite graphs
• NP-completeness of edge-colouring some restricted graphs
• The chromatic index of a graph whose core has maximum degree two
• Méthode et théorème général de coloration des aretes d'un multigraphe
• On the chromatic index of almost all graphs
• How to find overfull subgraphs in graphs with large maximum degree
• The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3
• How to find overfull subgraphs in graphs with large maximum degree. II
• On the chromatic index of join graphs and triangle-free graphs with large maximum degree
• Colouring the petals of a graph
• Edge-colouring of joins of regular graphs. II
• Edge-colouring of join graphs
• Edge-colouring of regular graphs of large degree
• On the edge-chromatic number of a graph
• The NP-completeness column: an ongoing guide
• Graphs which are vertex-critical with respect to the edge-chromatic number
• The chromatic index of graphs with a spanning star
• The NP-Completeness of Edge-Coloring
• Odd Minimum Cut-Sets and b-Matchings
• The chromatic index of complete multipartite graphs
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Paths in graphs
• The chromatic index of graphs of even order with many edges

This page was built for publication: Edge-colouring graphs with bounded local degree sums