The following pages link to (Q5530470):
Displaying 50 items.
- The \(m\)-degenerate chromatic number of a digraph (Q267198) (← links)
- Vertex-disjoint subgraphs with high degree sums (Q322265) (← links)
- On path decompositions of \(2k\)-regular graphs (Q324765) (← links)
- On two problems in graph Ramsey theory (Q377800) (← links)
- Reprint of: ``Grid representations and the chromatic number'' (Q390168) (← links)
- On 1-improper 2-coloring of sparse graphs (Q393935) (← links)
- Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (Q472396) (← links)
- On improperly chromatic-choosable graphs (Q497383) (← links)
- Co-2-plex vertex partitions (Q498448) (← links)
- The complexity of partitioning into disjoint cliques and a triangle-free graph (Q516874) (← links)
- WORM colorings of planar graphs (Q521753) (← links)
- New results on \(k\)-independence of graphs (Q528993) (← links)
- A note on a cycle partition problem (Q533476) (← links)
- On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number (Q539861) (← links)
- Partitions of graphs into cographs (Q607000) (← links)
- On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941) (← links)
- Bounds and fixed-parameter algorithms for weighted improper coloring (Q737104) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- The path partition conjecture is true for claw-free graphs (Q878616) (← links)
- Relaxed two-coloring of cubic graphs (Q885301) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
- Graph decomposition with constraints in the minimum degree (Q1102305) (← links)
- On a problem of Chvatal (Q1140102) (← links)
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density (Q1229732) (← links)
- A bound on the chromatic number of a graph (Q1245229) (← links)
- Another bound on the chromatic number of a graph (Q1248527) (← links)
- Chromatic number, girth and maximal degree (Q1252865) (← links)
- Extremal results on defective colorings of graphs (Q1318803) (← links)
- Graphical decompositions (Q1322291) (← links)
- Relaxed chromatic numbers of graphs (Q1323496) (← links)
- Bounded size components -- partitions and transversals. (Q1400964) (← links)
- Partitioning into graphs with only small components (Q1405114) (← links)
- Subcolorings and the subchromatic number of a graph (Q1412662) (← links)
- Graph partitions with minimum degree constraints (Q1584392) (← links)
- Generalized independence and domination in graphs (Q1584435) (← links)
- On the existence of vertex-disjoint subgraphs with high degree sum (Q1693134) (← links)
- Majority coloring game (Q1727720) (← links)
- Partitions of multigraphs under minimum degree constraints (Q1730245) (← links)
- On splitting digraphs (Q1750217) (← links)
- Path partitions and \(P_{n}\)-free sets (Q1763347) (← links)
- A hypocoloring model for batch scheduling (Q1765371) (← links)
- On monochromatic component size for improper colourings (Q1775062) (← links)
- On partitions of \(K_{2, 3}\)-free graphs under degree constraints (Q1800399) (← links)
- Geometrical embeddings of graphs (Q1825202) (← links)
- Vertex arboricity and maximum degree (Q1894756) (← links)
- Weighted improper colouring (Q1932354) (← links)
- Isomorphic bisections of cubic graphs (Q1984530) (← links)
- A note on coloring digraphs of large girth (Q2004076) (← links)
- Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← links)
