Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles (Q2815462): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Cor A. J. Hurkens / rank
Normal rank
 
Property / author
 
Property / author: Cor A. J. Hurkens / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2145323293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the vertex arboricity of planar graphs of diameter two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of partial directed line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The game of arboricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for acyclic colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Collective Model of Household Consumption: A Nonparametric Characterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonparametric tests of collectively rational consumption behavior: an integer programming procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class A Bézier curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The transitive closure of a random digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4704799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the vertex-arboricity of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for vertex arboricity of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of testing the collective axiom of revealed preference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for deciding collectively rational consumption behavior / 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: 2-list-coloring planar graphs without monochromatic triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232836 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:39, 12 July 2024

scientific article
Language Label Description Also known as
English
Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles
scientific article

    Statements

    Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    directed graph
    0 references
    undirected graph
    0 references
    bipartite graph
    0 references
    acyclic graph
    0 references
    phase transition
    0 references
    NP-complete
    0 references
    0 references