Pages that link to "Item:Q5189239"
From MaRDI portal
The following pages link to A structure theorem for graphs with no cycle with a unique chord and its consequences (Q5189239):
Displaying 40 items.
- Using SPQR-trees to speed up algorithms based on 2-cutset decompositions (Q324769) (← links)
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- On graphs with no induced subdivision of \(K_4\) (Q444381) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Excluding cycles with a fixed number of chords (Q476296) (← links)
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs (Q496654) (← links)
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- A new characterization of unichord-free graphs (Q891324) (← links)
- List neighbor sum distinguishing edge coloring of subcubic graphs (Q1686014) (← links)
- Requiring that minimal separators induce complete multipartite subgraphs (Q1692647) (← links)
- Strongly unichord-free graphs (Q1717190) (← links)
- Using SPQR-trees to speed up recognition algorithms based on 2-cutsets (Q1752488) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- Compositions, decompositions, and conformability for total coloring on power of cycle graphs (Q2091818) (← links)
- Even-power of cycles with many vertices are type 1 total colorable (Q2132416) (← links)
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs (Q2173431) (← links)
- The (theta, wheel)-free graphs. II: Structure theorem (Q2173432) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Chromatic index of graphs with no cycle with a unique chord (Q2267844) (← links)
- Wheel-free planar graphs (Q2349958) (← links)
- Characterizing atoms that result from decomposition by clique separators (Q2364081) (← links)
- Complexity separating classes for edge-colouring and total-colouring (Q2391946) (← links)
- New graph classes characterized by weak vertex separators and two-pairs (Q2409764) (← links)
- Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
- FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
- WHEN ALL MINIMAL VERTEX SEPARATORS INDUCE COMPLETE OR EDGELESS SUBGRAPHS (Q2864857) (← links)
- Total chromatic number of {square,unichord}-free graphs (Q2883635) (← links)
- Excluding Induced Subdivisions of the Bull and Related Graphs (Q2911052) (← links)
- Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
- A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs (Q3008921) (← links)
- Characterizing k-chordal unichord-free graphs (Q4577849) (← links)
- (Q5000291) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- Unique chords of unique cycles in 3-connected planar graphs (Q5858165) (← links)
- Detecting induced subgraphs (Q5900072) (← links)
- Triangle‐free graphs with large chromatic number and no induced wheel (Q6047638) (← links)
- Induced subgraphs and tree decompositions. VI: Graphs with 2-cutsets (Q6635076) (← links)
