Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782): Difference between revisions

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

Latest revision as of 04:13, 13 July 2024

scientific article; zbMATH DE number 6664876
Language Label Description Also known as
English
Two Chromatic Conjectures: One for Vertices and One for Edges
scientific article; zbMATH DE number 6664876

    Statements

    Two Chromatic Conjectures: One for Vertices and One for Edges (English)
    0 references
    0 references
    0 references
    16 December 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references