The following pages link to (Q3853641):
Displaying 50 items.
- Class one graphs (Q1112066) (← links)
- Labeling angles of planar graphs (Q1115878) (← links)
- Edge-coloured complete graphs: Connectedness of some subgraphs (Q1120587) (← links)
- Generalized handles in graphs and connected sums of manifolds (Q1120858) (← links)
- The cochromatic index of a graph (Q1144036) (← links)
- Construction of class two graphs with maximum vertex degree three (Q1147159) (← links)
- Even polyhedral decompositions of cubic graphs (Q1149455) (← links)
- Note sur la non existence d'un snark d'ordre 16 (Q1157340) (← links)
- Hamiltonian cycles in the cartesian product of a tree and a cycle (Q1158171) (← links)
- On graphs critical with respect to edge-colourings (Q1164055) (← links)
- Snarks of order 18 (Q1168330) (← links)
- Hamiltonian paths in vertex-symmetric graphs of order 5p (Q1172069) (← links)
- NP-completeness of edge-colouring some restricted graphs (Q1173977) (← links)
- A polyhedral approach to edge coloring (Q1180838) (← links)
- Decompositions of graphs into forests with bounded maximum degree (Q1185098) (← links)
- Edge colouring line graphs of unicyclic graphs (Q1186166) (← links)
- The chromatic index of a graph whose core has maximum degree two (Q1197023) (← links)
- Remarks on the critical graph conjecture (Q1256492) (← links)
- Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings (Q1305535) (← links)
- A generalization of chromatic index (Q1313837) (← links)
- Incidence and strong edge colorings of graphs (Q1313849) (← links)
- Parallel concepts in graph theory (Q1324287) (← links)
- A homology theory for colored graphs (Q1343779) (← links)
- The chromatic index of graphs of high maximum degree (Q1356656) (← links)
- 3- and 4-critical graphs of small even order (Q1357738) (← links)
- On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs (Q1363709) (← links)
- Remarks on the size of critical edge-chromatic graphs (Q1363711) (← links)
- The edge chromatic difference sequence of a cubic graph (Q1377864) (← links)
- Extending fixed vertex-colourings to total colourings (Q1377889) (← links)
- Characterizing and edge-colouring split-indifference graphs (Q1383379) (← links)
- On the size of edge chromatic critical graphs (Q1403929) (← links)
- The total chromatic number of graphs of even order and high degree (Q1408886) (← links)
- An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree (Q1408892) (← links)
- Classification and characterizations of snarks (Q1584327) (← links)
- Edge colorings of graphs embeddable in a surface of low genus (Q1584389) (← links)
- Special first order systems in Clifford analysis and resolutions. (Q1607597) (← links)
- Adjacent strong edge coloring of graphs (Q1609524) (← links)
- Edge coloring of planar graphs without adjacent 7-cycles (Q1643159) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Edge colorings of planar graphs without 6-cycles with three chords (Q1746732) (← links)
- Hadwiger's conjecture and inflations of the Petersen graph (Q1759395) (← links)
- Trees with maximum nullity (Q1774973) (← links)
- 2-3 graphs which have Vizing's adjacency property (Q1821113) (← links)
- Clique covers and coloring problems of graphs (Q1823258) (← links)
- Isomorphic factorization of r-regular graphs into r parts (Q1825883) (← links)
- On the chromatic forcing number of a random graph (Q1837705) (← links)
- The achromatic indices of the regular complete multipartite graphs (Q1894758) (← links)
- There are no edge-chromatic 4-critical graphs of order 12 (Q1894759) (← links)
- Note on a conjecture of Toft (Q1900186) (← links)
- Parsimonious edge coloring (Q1910535) (← links)
