Unavoidable vertex-minors in large prime graphs (Q740266): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2026359334 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1306.3066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isotropic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing prime graphs and recognizing circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphic presentations of isotropic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graph obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unavoidable parallel minors of 4-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unavoidable doubly connected large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unavoidable minors of large 3-connected binary matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing circle graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circle graph obstructions under pivoting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconnaissance des graphes de cordes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typical subgraphs of 3- and 4-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank

Revision as of 23:22, 8 July 2024

scientific article
Language Label Description Also known as
English
Unavoidable vertex-minors in large prime graphs
scientific article

    Statements

    Identifiers