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.
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs (Q1345961) (← links)
- Complexity of list coloring problems with a fixed total number of colors (Q1348378) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- The setup polyhedron of series-parallel posets (Q1372744) (← links)
- Chair-free Berge graphs are perfect (Q1376074) (← links)
- A fast parallel algorithm to recognize P4-sparse graphs (Q1382265) (← links)
- 3-colorability and forbidden subgraphs. I: Characterizing pairs (Q1422435) (← links)
- Square-free perfect graphs. (Q1426100) (← links)
- Triangle-free graphs and forbidden subgraphs (Q1613361) (← links)
- Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\) (Q1637095) (← links)
- Colouring of \((P_3 \cup P_2)\)-free graphs (Q1706425) (← links)
- Star coloring of certain graph classes (Q1706426) (← links)
- Coupon coloring of cographs (Q1738081) (← links)
- A simple linear time algorithm for cograph recognition (Q1764804) (← links)
- Chromatic bounds for some classes of \(2 K_2\)-free graphs (Q1783621) (← links)
- The allocation problem in hardware design (Q1801667) (← links)
- Transfer flow graphs (Q1801698) (← links)
- Bichromatic \(P_{4}\)-composition schemes for perfect orderability (Q1827860) (← links)
- Recognizing bull-free perfect graphs (Q1895822) (← links)
- Scheduling of conditional executed jobs on unrelated processors (Q1897352) (← links)
- An optimal path cover algorithm for cographs (Q1903198) (← links)
- On the \(P_4\)-components of graphs (Q1971221) (← links)
- Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\) (Q2062815) (← links)
- Algorithms for maximum internal spanning tree problem for some graph classes (Q2091107) (← links)
- Generalizing cographs to 2-cographs (Q2111769) (← links)
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs (Q2138579) (← links)
- Characterizing forbidden pairs for relative length of longest paths and cycles (Q2138962) (← links)
- Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \) (Q2144485) (← links)
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions (Q2166229) (← links)
- Forbidden triples generating a finite set of graphs with minimum degree three (Q2166238) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
- Distance eigenvalues of a cograph and their multiplicities (Q2226412) (← links)
- Graphs with few trivial characteristic ideals (Q2229515) (← links)
- On graphs whose third largest distance eigenvalue dose not exceed \(-1\) (Q2242780) (← links)
- The Erdős-Hajnal conjecture for rainbow triangles (Q2259857) (← links)
- Faster algorithms for cograph edge modification problems (Q2308466) (← links)
- Cographs: eigenvalues and Dilworth number (Q2317646) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- On the vertex packing problem (Q2366214) (← links)
- On \(r\)-hued colorings of graphs without short induced paths (Q2421855) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Lines in hypergraphs (Q2439836) (← links)
- Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
- Minimal volume product near Hanner polytopes (Q2452489) (← links)
- Competitive graph searches (Q2481952) (← links)
- Skew partitions in perfect graphs (Q2482110) (← links)
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games (Q2515585) (← links)
- Forbidden pairs and the existence of a dominating cycle (Q2515588) (← links)
- Minimal colorings for properly colored subgraphs (Q2563425) (← links)
