Two Chromatic Conjectures: One for Vertices and One for Edges

DOI10.1007/978-3-319-31940-7_11zbMath1352.05071OpenAlexW2536060116MaRDI QIDQ5506782

P. Mark Kayll

Publication date: 16 December 2016

Published in: Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-31940-7_11

Mathematics Subject Classification ID

Hypergraphs (05C65) Biographies, obituaries, personalia, bibliographies (01A70) Development of contemporary mathematics (01A65) Coloring of graphs and hypergraphs (05C15) History of combinatorics (05-03)

Related Items (3)

Graph and hypergraph colouring via nibble methods: a survey ⋮ A proof of the Erdős-Faber-Lovász conjecture ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Erdős-Faber-Lovász conjecture -- the uniform regular case
• Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
• List edge and list total coloring of 1-planar graphs
• Proof of the list edge coloring conjecture for complete graphs of prime degree
• On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability
• List edge and list total colorings of planar graphs without 4-cycles
• A note on the Erdős--Farber--Lovász conjecture
• Edge and total choosability of near-outerplanar graphs
• Edge choosability of planar graphs without short cycles
• Kernels in perfect line-graphs
• On the chromatic index of a finite projective space
• List edge and list total colorings of planar graphs without short cycles
• List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
• Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
• Edge choosability of planar graphs without 5-cycles with a chord
• Total colorings and list total colorings of planar graphs without intersecting 4-cycles
• List-colourings of graphs
• Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
• Towards a solution of the Dinitz problem?
• A new upper bound for the list chromatic number
• Asymptotics of the chromatic index for multigraphs
• On the combinatorial problems which I would most like to see solved
• Packing nearly-disjoint sets
• Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
• Colorings and orientations of graphs
• A fractional version of the Erdős-Faber-Lovász conjecture
• On the stochastic independence properties of hard-core distributions
• The b-chromatic number of a graph
• Edge-choosability in line-perfect multigraphs
• Edge-choosability of multicircuits
• List edge and list total colourings of multigraphs
• Coloring graphs with sparse neighborhoods
• List edge-colorings of series-parallel graphs
• Choosability, edge choosability and total choosability of outerplane graphs
• The list chromatic index of a bipartite multigraph
• Asymptotically good list-colorings
• \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
• The list-chromatic index of \(K_6\)
• The Erdős-Faber-Lovász conjecture for dense hypergraphs
• A remark on the conjecture of Erdös, Faber and Lovász
• List edge colourings of some 1-factorable multigraphs
• LIST EDGE AND LIST TOTAL COLORINGS OF PLANAR GRAPHS WITHOUT 6-CYCLES WITH CHORD
• ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE
• The Erdős–Faber–Lovász conjecture is true for n ≤ 12
• The Colorado Mathematical Olympiad and Further Explorations
• A note on list-colorings
• On a Conjecture of Erdös, Faber, and Lovász about n-Colorings
• Some upper bounds on the total and list chromatic numbers of multigraphs
• The Dinitz problem solved for rectangles
• New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
• A clone-theoretic formulation of the Erdős-Faber-Lovász conjecture
• Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
• A Theorem on Coloring the Lines of a Network
• The Lines and Planes Connecting the Points of a Finite Set

This page was built for publication: Two Chromatic Conjectures: One for Vertices and One for Edges