Orientations of graphs with prescribed weighted out-degrees

DOI10.1007/s00373-013-1382-0zbMath1306.05089OpenAlexW1984574113MaRDI QIDQ489364

Margit Voigt, Michael Stiebitz, Zsolt Tuza

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1382-0

zbMATH Keywords

chromatic numberkernelsorientationsBrooks' theoremvertex weighted graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Brooks' theorem via the Alon-Tarsi theorem
• Graph coloring in linear time
• Colorings and orientations of graphs
• A solution to a colouring problem of P. Erdős
• Edge-choosability of multicircuits
• List \(T\)-colorings of graphs
• Choosability of powers of circuits
• The list chromatic index of a bipartite multigraph
• On the complexity of the disjoint paths problem
• Incidence matrices and interval graphs
• On the degrees of the vertices of a directed graph
• Solutions of irreflexive relations
• Graph colorings with local constraints -- a survey
• On Representatives of Subsets
• On chromatic number of graphs and set-systems
• Nombre chromatique et plus longs chemins d'un graphe
• Zur algebraischen Begründung der Graphentheorie. I