Pages that link to "Item:Q2563166"
From MaRDI portal
The following pages link to On a property of the class of n-colorable graphs (Q2563166):
Displaying 50 items.
- Forbidden subgraphs and the existence of a spanning tree without small degree stems (Q390302) (← links)
- Excluding pairs of graphs (Q402589) (← links)
- The price of connectivity for dominating set: upper bounds and complexity (Q406321) (← links)
- On the spectrum of threshold graphs (Q410640) (← links)
- Cycle-maximal triangle-free graphs (Q472981) (← links)
- The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\) (Q517364) (← links)
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Partitions of graphs into cographs (Q607000) (← links)
- Partial characterizations of circle graphs (Q643006) (← links)
- A characterization of claw-free \(b\)-perfect graphs (Q658056) (← links)
- Dominator colorings in some classes of graphs (Q659760) (← links)
- Partial characterization of graphs having a single large Laplacian eigenvalue (Q668039) (← links)
- Restrictions of graph partition problems. I (Q672380) (← links)
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs (Q673108) (← links)
- On the structure of bull-free perfect graphs (Q675887) (← links)
- Complexity and parameterized algorithms for cograph editing (Q690461) (← links)
- Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four (Q831869) (← links)
- A bipartite analogue of Dilworth's theorem (Q862983) (← links)
- Characterization of \(P_{6}\)-free graphs (Q881583) (← links)
- On the complexity of role colouring planar graphs, trees and cographs (Q891815) (← links)
- Completely separable graphs (Q908944) (← links)
- Primitivity is hereditary for 2-structures (Q913824) (← links)
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families (Q966046) (← links)
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361) (← links)
- Infinite versus finite graph domination (Q968422) (← links)
- Paired-domination in \(P_{5}\)-free graphs (Q1014817) (← links)
- Complete description of forbidden subgraphs in the structural domination problem (Q1025505) (← links)
- Vertex- and edge-minimal and locally minimal graphs (Q1043552) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Generalized complementation (Q1072574) (← links)
- Bull-free Berge graphs are perfect (Q1095938) (← links)
- Murky graphs (Q1101470) (← links)
- Locally perfect graphs (Q1105623) (← links)
- Wings and perfect graphs (Q1112849) (← links)
- Some perfect coloring properties of graphs (Q1136777) (← links)
- Complement reducible graphs (Q1153105) (← links)
- Short-chorded and perfect graphs (Q1174781) (← links)
- Dominating cliques in \(P_ 5\)-free graphs (Q1176051) (← links)
- On a unique tree representation for \(P_ 4\)-extendible graphs (Q1182318) (← links)
- A tree representation for \(P_ 4\)-sparse graphs (Q1183332) (← links)
- Processor optimization for flow graphs (Q1200808) (← links)
- A note on a paper by D. Seinsche (Q1213880) (← links)
- Base polytopes of series-parallel posets: Linear description and optimization (Q1290639) (← links)
- On minimal imperfect graphs without induced \(P_5\) (Q1293187) (← links)
- Sequential colorings and perfect graphs (Q1293205) (← links)
- Functions that are read-once on a subset of their inputs (Q1308741) (← links)
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\) (Q1334944) (← links)
- Slightly triangulated graphs are perfect (Q1340126) (← links)
- Characterization of \((m,1)\)-transitive and \((3,2)\)-transitive semi- complete directed graphs (Q1343273) (← links)