Two Chromatic Conjectures: One for Vertices and One for Edges
From MaRDI portal
Recommendations
- Two conjectures on edge-colouring
- scientific article; zbMATH DE number 4070929
- scientific article; zbMATH DE number 1512685
- scientific article; zbMATH DE number 4214051
- Two chromatic polynomial conjectures
- scientific article; zbMATH DE number 773201
- scientific article; zbMATH DE number 3873358
- A conjecture on edge coloring of graphs
- Two conjectures on uniquely totally colorable graphs
- A conjecture of a vertex-distinguishing edge coloring of graphs
Cites work
- scientific article; zbMATH DE number 981679 (Why is no real title available?)
- scientific article; zbMATH DE number 446487 (Why is no real title available?)
- scientific article; zbMATH DE number 45272 (Why is no real title available?)
- scientific article; zbMATH DE number 3634284 (Why is no real title available?)
- scientific article; zbMATH DE number 736299 (Why is no real title available?)
- scientific article; zbMATH DE number 1131467 (Why is no real title available?)
- scientific article; zbMATH DE number 1523257 (Why is no real title available?)
- scientific article; zbMATH DE number 6424528 (Why is no real title available?)
- scientific article; zbMATH DE number 5018197 (Why is no real title available?)
- scientific article; zbMATH DE number 3049937 (Why is no real title available?)
- A Theorem on Coloring the Lines of a Network
- A clone-theoretic formulation of the Erdős-Faber-Lovász conjecture
- A fractional version of the Erdős-Faber-Lovász conjecture
- A new upper bound for the list chromatic number
- A note on list-colorings
- A note on the Erdős--Farber--Lovász conjecture
- A remark on the conjecture of Erdös, Faber and Lovász
- Advances on the Erdős-Faber-Lovász conjecture
- Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
- Asymptotically good list-colorings
- Asymptotics of the chromatic index for multigraphs
- Choosability, edge choosability and total choosability of outerplane graphs
- Coloring graphs with sparse neighborhoods
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
- Colorings and orientations of graphs
- Edge and total choosability of near-outerplanar graphs
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
- Edge choosability of planar graphs without 5-cycles with a chord
- Edge choosability of planar graphs without short cycles
- Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
- Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
- Edge-choosability in line-perfect multigraphs
- Edge-choosability of multicircuits
- Graph theory
- Kernels in perfect line-graphs
- List edge and list total coloring of 1-planar graphs
- List edge and list total colorings of planar graphs without 4-cycles
- List edge and list total colorings of planar graphs without 6-cycles with chord
- List edge and list total colorings of planar graphs without short cycles
- List edge and list total colourings of multigraphs
- List edge colourings of some 1-factorable multigraphs
- List edge-colorings of series-parallel graphs
- List-colourings of graphs
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
- On a Conjecture of Erdös, Faber, and Lovász about n-Colorings
- On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture
- On the Erdős-Faber-Lovász Conjecture.
- On the chromatic index of a finite projective space
- On the combinatorial problems which I would most like to see solved
- On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability
- On the stochastic independence properties of hard-core distributions
- Packing nearly-disjoint sets
- Proof of the list edge coloring conjecture for complete graphs of prime degree
- Some upper bounds on the total and list chromatic numbers of multigraphs
- The Colorado Mathematical Olympiad and further explorations. From the mountains of Colorado to the peaks of mathematics
- The Dinitz problem solved for rectangles
- The Erdős-Faber-Lovász conjecture -- the uniform regular case
- The Erdős-Faber-Lovász conjecture for dense hypergraphs
- The Erdős-Faber-Lovász conjecture is true for n 12
- The Lines and Planes Connecting the Points of a Finite Set
- The b-chromatic number of a graph
- The edge choosability of \(C_{n} \times P_{m}\).
- The list chromatic index of a bipartite multigraph
- The list-chromatic index of \(K_6\)
- The wonderful Walecki construction
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- Towards a solution of the Dinitz problem?
- b-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
Cited in
(4)
This page was built for publication: Two Chromatic Conjectures: One for Vertices and One for Edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5506782)
