Pages that link to "Item:Q1121901"
From MaRDI portal
The following pages link to 1-factorizing regular graphs of high degree - an improved bound (Q1121901):
Displaying 27 items.
- Some criteria for a graph to be class 1 (Q442377) (← links)
- Recent results on the total chromatic number (Q686483) (← links)
- The chromatic index of a graph whose core is a cycle of order at most 13 (Q742593) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Graph divisible designs and packing constructions (Q897275) (← links)
- Matching divisible designs with block size four (Q898140) (← links)
- An application of Tutte's theorem to 1-factorization of regular graphs of high degree (Q1044942) (← links)
- Two conjectures on edge-colouring (Q1123197) (← links)
- On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs (Q1126293) (← links)
- The chromatic index of a graph whose core has maximum degree two (Q1197023) (← links)
- Total chromatic number of graphs of odd order and high degree (Q1301827) (← links)
- Totally critical even order graphs (Q1306315) (← links)
- How to find overfull subgraphs in graphs with large maximum degree (Q1329811) (← links)
- The chromatic index of graphs of high maximum degree (Q1356656) (← links)
- Edge coloring regular graphs of high degree (Q1356779) (← links)
- Vertex-splitting and chromatic index critical graphs (Q1363752) (← links)
- Regular factors of simple regular graphs and factor-spectra (Q1584246) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Total chromatic number of regular graphs of odd order and high degree (Q1918537) (← links)
- The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\) (Q2138974) (← links)
- The chromatic index of a claw-free graph whose core has maximum degree 2 (Q2354597) (← links)
- Grooming for two-period optical networks (Q3548732) (← links)
- Factorization of regular multigraphs into regular graphs (Q4320469) (← links)
- The number of disjoint perfect matchings in semi-regular graphs (Q5034273) (← links)
- Decomposing Graphs of High Minimum Degree into 4‐Cycles (Q5265328) (← links)
- Proof of the 1-factorization and Hamilton Decomposition Conjectures (Q5283773) (← links)
- Edge coloring graphs with large minimum degree (Q6094039) (← links)
