Pages that link to "Item:Q444381"

The following pages link to On graphs with no induced subdivision of \(K_4\) (Q444381):

Displaying 26 items.

• Restricted frame graphs and a conjecture of Scott (Q252837) (← links)
• Using SPQR-trees to speed up algorithms based on 2-cutset decompositions (Q324769) (← links)
• Graph editing to a fixed target (Q344855) (← links)
• Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
• Chromatic number of ISK4-free graphs (Q1696549) (← links)
• Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs (Q1709574) (← links)
• Strongly unichord-free graphs (Q1717190) (← links)
• Using SPQR-trees to speed up recognition algorithms based on 2-cutsets (Q1752488) (← links)
• Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings (Q2040019) (← links)
• Induced disjoint paths in AT-free graphs (Q2051862) (← links)
• Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs (Q2111937) (← links)
• The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs (Q2173431) (← links)
• The (theta, wheel)-free graphs. III: Cliques, stable sets and coloring (Q2173433) (← links)
• The chromatic number of graphs with no induced subdivision of \(K_4\) (Q2175802) (← links)
• Wheel-free planar graphs (Q2349958) (← links)
• Detecting an induced subdivision of \(K_{4}\) (Q2413192) (← links)
• Amalgams and χ-Boundedness (Q2958199) (← links)
• On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph (Q2978173) (← links)
• Nonseparating <i>K</i>₄‐subdivisions in graphs of minimum degree at least 4 (Q4553735) (← links)
• Acyclic chromatic index of chordless graphs (Q6041561) (← links)
• The chromatic number of {ISK4, diamond, bowtie}‐free graphs (Q6055409) (← links)
• Some remarks on graphs with no induced subdivision of \(K_4\) (Q6064854) (← links)
• Burling graphs revisited. III: Applications to \(\chi \)-boundedness (Q6146493) (← links)
• Characterizing and generalizing cycle completable graphs (Q6184532) (← links)
• Induced regular perfect graphs (Q6563829) (← links)
• Induced subgraphs and tree decompositions. VI: Graphs with 2-cutsets (Q6635076) (← links)