A minimum degree condition forcing complete graph immersion (Q397072): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graph Coloring and the Immersion Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms forK4Immersion Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Immersing small complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3905312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconstructive tools for proving polynomial-time decidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependent random choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological cliques in graphs II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound of the Hadwiger number of graphs by their average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors XXIII. Nash-Williams' immersion conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture for \(K_ 6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank

Latest revision as of 21:20, 8 July 2024

scientific article
Language Label Description Also known as
English
A minimum degree condition forcing complete graph immersion
scientific article

    Statements

    A minimum degree condition forcing complete graph immersion (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 August 2014
    0 references
    graph immersion
    0 references
    minimum degree
    0 references
    line graph
    0 references

    Identifiers

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