Edge-colouring graphs with bounded local degree sums

DOI10.1016/J.DAM.2020.03.044MaRDI QIDQ2184694zbMATH OpenOpenAlexFDO

Authors Leandro M. Zatesko, A. Zorzi, 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

colouring of hypergraphsgraph algorithmsvertex degrees

Mathematics Subject Classification ID

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

Recommendations

• Local edge coloring of graphs
• Publication:4489142
• scientific article; zbMATH DE number 1463393
• Sum coloring of bipartite graphs with bounded degree
• Properly edge-coloured subgraphs in colourings of bounded degree
• Coloring graphs with locally few colors
• On the local colorings of graphs
• scientific article; zbMATH DE number 1885944
• scientific article; zbMATH DE number 2188610
• Vertex-distinguishing edge colorings of graphs with degree sum conditions

Cites work

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

Cited in

(6)

• Sum coloring of bipartite graphs with bounded degree
• scientific article; zbMATH DE number 1463393 (Why is no real title available?)
• scientific article; zbMATH DE number 1472095 (Why is no real title available?)
• The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark
• Properly edge-coloured subgraphs in colourings of bounded degree
• A note on the Bollobás-Nikiforov conjecture

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2184694)