A unified approach to distance-two colouring of graphs on surfaces (Q2439826): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 0812.1345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Powers of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4797462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound on the cyclic chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cyclic colorings and their generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Colouring Squares of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest planar graphs of diameter two and fixed maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: List-colouring the square of a \(K_4\)-minor-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the square of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / 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: 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: Choosability conjectures and multicircuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the square of a \(K_{4}\)-minor free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphiesätze für Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colouring and the probabilistic method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the chromatic number of the square of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5591378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound on the cyclic chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Coloring the Lines of a Network / rank
 
Normal rank

Latest revision as of 12:13, 7 July 2024

scientific article
Language Label Description Also known as
English
A unified approach to distance-two colouring of graphs on surfaces
scientific article

    Statements

    A unified approach to distance-two colouring of graphs on surfaces (English)
    0 references
    0 references
    0 references
    0 references
    17 March 2014
    0 references
    colouring
    0 references
    cyclic colouring
    0 references
    embedded graph
    0 references
    list colouring
    0 references
    square graph
    0 references

    Identifiers