Independent paths and \(K_{5}\)-subdivisions (Q602715): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jctb.2010.05.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976030201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hajos' graph-coloring conjecture: Variations and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph connectivity after path removal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonseparating Cycles in 4-Connected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractible edges and triangles in \(k\)-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-separating paths in 4-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Do 3n − 5 edges force a subdivision ofK5? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced paths in 5-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(3n-5\) edges do force a subdivision of \(K_5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Solution to the Undirected Two Paths Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Draw a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles and Connectivity in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdivisions in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing Hajós' 4-coloring conjecture to 4-connected graphs / rank
 
Normal rank

Latest revision as of 09:55, 3 July 2024

scientific article
Language Label Description Also known as
English
Independent paths and \(K_{5}\)-subdivisions
scientific article

    Statements

    Independent paths and \(K_{5}\)-subdivisions (English)
    0 references
    0 references
    0 references
    5 November 2010
    0 references
    subdivision of graph
    0 references
    independent paths
    0 references
    nonseparating path
    0 references
    planar graph
    0 references

    Identifiers