Pages that link to "Item:Q1223319"
From MaRDI portal
The following pages link to Three short proofs in graph theory (Q1223319):
Displayed 50 items.
- On \(r\)-dynamic coloring of graphs (Q277619) (← links)
- Brooks' theorem for generalized dart graphs (Q413285) (← links)
- Max-leaves spanning tree is APX-hard for cubic graphs (Q414465) (← links)
- A unified proof of Brooks' theorem and Catlin's theorem (Q472980) (← links)
- A characterization of the prime graphs of solvable groups. (Q492997) (← links)
- Price of anarchy for graph coloring games with concave payoff (Q501743) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- Brooks' theorem via the Alon-Tarsi theorem (Q712277) (← links)
- Regular factors in nearly regular graphs (Q795844) (← links)
- \(\Delta \)-list vertex coloring in linear time (Q844167) (← links)
- On the hardness of computing span of subcubic graphs (Q888955) (← links)
- Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs (Q897950) (← links)
- The chromatic number of a signed graph (Q907266) (← links)
- Efficient bounds for the stable set, vertex cover and set packing problems (Q1056763) (← links)
- The linzertorte problem, or a unified approach to painting, baking and weaving (Q1081611) (← links)
- On constructive methods in the theory of colour-critical graphs (Q1121899) (← links)
- Non-separating induced cycles in graphs (Q1150377) (← links)
- Directed star decompositions of directed multigraphs (Q1183974) (← links)
- An extension of Tutte's 1-factor theorem (Q1256496) (← links)
- Differential approximation algorithms for some combinatorial optimization problems (Q1274917) (← links)
- A generalization of König-Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios (Q1278660) (← links)
- Improved approximations for maximum independent set via approximation chains (Q1372278) (← links)
- On essential components and critical sets of a graph (Q1377850) (← links)
- The many facets of upper domination (Q1704853) (← links)
- Representations of families of triples over \(GF(2)\) (Q1812889) (← links)
- A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem (Q1815327) (← links)
- Optimal three-dimensional orthogonal graph drawing in the general position model. (Q1874390) (← links)
- Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
- Partitioning a graph into degenerate subgraphs (Q2011133) (← links)
- Graph \(r\)-hued colorings -- a survey (Q2172387) (← links)
- On a Lovász-type lemma, applied to Brooks' theorem for list-colouring (Q2275459) (← links)
- Approximation algorithms for vertex happiness (Q2326078) (← links)
- A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
- An exact algorithm for MAX-CUT in sparse graphs (Q2467485) (← links)
- Maximum weight edge-constrained matchings (Q2476253) (← links)
- On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← links)
- A different short proof of Brooks' theorem (Q2509552) (← links)
- A simple approximation algorithm for WIS based on the approximability in \(k\)-partite graphs (Q2576274) (← links)
- Brooks-type theorem for \(r\)-hued coloring of graphs (Q2696623) (← links)
- Vertex-Coloring with Star-Defects (Q2803807) (← links)
- Upper Domination: Complexity and Approximation (Q2819508) (← links)
- Saturated Simple and 2-simple Topological Graphs with Few Edges (Q2827825) (← links)
- Graphs with $\chi=\Delta$ Have Big Cliques (Q2949718) (← links)
- Dichotomy for Coloring of Dart Graphs (Q3000496) (← links)
- Spotting Trees with Few Leaves (Q3448789) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- Coloring Graphs with Constraints on Connectivity (Q4978449) (← links)
- On approximation properties of the Independent set problem for degree 3 graphs (Q5057456) (← links)
- A short proof of Brooks’ Theorem for vertex arboricity (Q5154607) (← links)
- Spotting Trees with Few Leaves (Q5346548) (← links)