The following pages link to (Q5528475):
Displaying 50 items.
- On doubly light triangles in plane graphs (Q383767) (← links)
- On dynamic coloring for planar graphs and graphs of higher genus (Q423914) (← links)
- Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
- Surface embedding of \((n,k)\)-extendable graphs (Q477346) (← links)
- Grassmann homomorphism and Hajós-type theorems (Q518115) (← links)
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243) (← links)
- On quadrangular convex 3-polytopes with at most two types of edges (Q582578) (← links)
- Duality and perfection for edges in cliques (Q595674) (← links)
- Guthrie's problem: new equivalences and rapid reductions (Q672855) (← links)
- Characterizing 4-critical graphs with Ore-degree at most seven (Q684124) (← links)
- Packings and perfect path double covers of maximal planar graphs (Q686163) (← links)
- An extension of a fixed point problem for simple graphs (Q686510) (← links)
- A manifold of pure Gibbs states of the Ising model on a Cayley tree (Q690730) (← links)
- The thickness and chromatic number of \(r\)-inflated graphs (Q709322) (← links)
- Chromatic polynomials of connected graphs (Q790846) (← links)
- Inductive definition of two restricted classes of triangulations (Q801927) (← links)
- A new method of proving theorems on chromatic index (Q801928) (← links)
- Toughness and Delaunay triangulations (Q803161) (← links)
- The clique-partitioning problem (Q807637) (← links)
- A theory of rectangular dual graphs (Q923112) (← links)
- Restricted matching in graphs of small genus (Q998321) (← links)
- Intersection properties of boxes in \(R^ n\). (Q1050625) (← links)
- On 1-factorizability of Cayley graphs (Q1068102) (← links)
- Simplicial schemes (Q1068841) (← links)
- Independent sets in k-chromatic graphs (Q1076033) (← links)
- On Tutte polynomials and cycles of plane graphs (Q1077427) (← links)
- An algorithm for the characterization of the nonplanarity of a maximal graphical partition (Q1095148) (← links)
- Matching extension and the genus of a graph (Q1107545) (← links)
- A graph-theoretical characterization of the order complexes on the 2- sphere (Q1113918) (← links)
- On the Penrose number of cubic diagrams (Q1124600) (← links)
- Flows and generalized coloring theorems in graphs (Q1133552) (← links)
- Interval matroids and graphs (Q1134768) (← links)
- On a covering problem of Mullin and Stanton for binary matroids (Q1139053) (← links)
- Some counterexamples associated with the three-color problem (Q1139601) (← links)
- On the geometry of semigroup presentations (Q1141761) (← links)
- The enumeration problem for color critical linear hypergraphs (Q1144047) (← links)
- Critical hypergraphs for the weak chromatic number (Q1148325) (← links)
- Kempe classes and the Hadwiger conjecture (Q1157337) (← links)
- Graphs having circuits with at least two chords (Q1160634) (← links)
- On the enumeration of chains in regular chain-groups (Q1164635) (← links)
- Shortness parameters of families of regular planar graphs in two or three types of faces (Q1167746) (← links)
- On the existence and connectivity of a class of maximal planar graphs (Q1168337) (← links)
- On the thickness of graphs of given degree (Q1174334) (← links)
- Note on inscribability of quadrangular polyhedra with restricted number of edge-types (Q1180135) (← links)
- A linear-time algorithm for finding an ambitus (Q1186786) (← links)
- On Hadwiger's number---A problem of the Nordhaus-Gaddum type (Q1197037) (← links)
- 6-valent analogues of Eberhard's theorem (Q1211056) (← links)
- Über minimale, nichtprojektive Graphen mit einer Kreuzhaube (Q1211995) (← links)
- The importance of being Euler (Q1212467) (← links)
- A practical approach to the chromatic partition problem (Q1212946) (← links)
