Coloring graphs without short cycles and long induced paths (Q2440105): 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: Petr A. Golovach / rank
Normal rank
 
Property / author
 
Property / author: Petr A. Golovach / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2013.12.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997543816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free graphs and forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating the complexity status of coloring graphs without a fixed induced linear forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Coloring in the Absence of a Linear Forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring vertices of triangle-free graphs without forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-coloring \(H\)-free graphs when \(H\) is small / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Coloring Graphs without Paths and Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Complexity Results on k-Coloring P t -Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized coloring for tree-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3558598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4838453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of 4-coloring graphs without long induced paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP completeness of finding the chromatic index of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic number of finite set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of the existence of highly chromatic hypergraphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex colouring and forbidden subgraphs -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new hereditary classes where graph coloring remains NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colorings with local constraints -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2770587 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:13, 7 July 2024

scientific article
Language Label Description Also known as
English
Coloring graphs without short cycles and long induced paths
scientific article

    Statements

    Coloring graphs without short cycles and long induced paths (English)
    0 references
    0 references
    0 references
    0 references
    27 March 2014
    0 references
    graph coloring
    0 references
    girth
    0 references
    forbidden induced subgraph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references