Problems on cycles and colorings (Q383772): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The strong chromatic index of a cubic graph is at most 10 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3944542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precoloring extension. I: Interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE COMPLEXITY OF SOME COLORING GAMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of hereditary properties of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3649378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-bounded hypergraphs, IV: Stable colorings of hypertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-bounded hypergraphs. VI: Structural and functional jumps in complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with \(k\) odd cycle lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two graph-colouring games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4838466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle length parities and the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle lengths and chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on n-Coloring the Points of a Linear Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Misère quotients for impartial games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On color critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nombre chromatique et plus longs chemins d'un graphe / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some two-person perfect-information games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized colorings and avoidable orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3984533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph coloring in linear time / rank
 
Normal rank

Latest revision as of 02:54, 7 July 2024

scientific article
Language Label Description Also known as
English
Problems on cycles and colorings
scientific article

    Statements

    Problems on cycles and colorings (English)
    0 references
    0 references
    6 December 2013
    0 references
    graph coloring
    0 references
    cycles in graphs
    0 references
    hypergraph coloring
    0 references
    open problems
    0 references

    Identifiers