Pages that link to "Item:Q1850561"
From MaRDI portal
The following pages link to Planar graphs of maximum degree seven are Class I (Q1850561):
Displayed 48 items.
- The edge colorings of \(K_5\)-minor free graphs (Q2022144) (← links)
- A sufficient condition for an IC-planar graph to be class 1 (Q2053694) (← links)
- Facial visibility in edge colored plane graphs (Q2062889) (← links)
- Subcubic planar graphs of girth 7 are class I (Q2144599) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- A survey on the cyclic coloring and its relaxations (Q2214302) (← links)
- Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable (Q2230029) (← links)
- Total-coloring of sparse graphs with maximum degree 6 (Q2240657) (← links)
- Chromatic index of graphs with no cycle with a unique chord (Q2267844) (← links)
- Incidence coloring -- cold cases (Q2282487) (← links)
- Upper bounds on the maximum degree of class two graphs on surfaces (Q2286600) (← links)
- Edge-partition and star chromatic index (Q2335139) (← links)
- Edge coloring of graphs embedded in a surface of nonnegative characteristic (Q2401779) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\) (Q2409528) (← links)
- On the equitable edge-coloring of 1-planar graphs and planar graphs (Q2409529) (← links)
- The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\) (Q2410091) (← links)
- Facial rainbow edge-coloring of plane graphs (Q2413633) (← links)
- Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable (Q2424665) (← links)
- A sufficient condition for a planar graph to be class I (Q2456359) (← links)
- New linear-time algorithms for edge-coloring planar graphs (Q2479530) (← links)
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1 (Q2497482) (← links)
- A note on class one graphs with maximum degree six (Q2497484) (← links)
- On the independence number of edge chromatic critical graphs (Q2509546) (← links)
- Local neighbor-distinguishing index of graphs (Q2693079) (← links)
- A Markov chain on the solution space of edge colorings of bipartite graphs (Q2696608) (← links)
- Finding Δ(Σ) for a Surface Σ of Characteristic −4 (Q2833122) (← links)
- Acyclic edge-colouring of planar graphs. Extended abstract (Q2851497) (← links)
- Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable (Q2947439) (← links)
- Vizing's coloring algorithm and the fan number (Q3055930) (← links)
- Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles (Q3066941) (← links)
- A new upper bound for the independence number of edge chromatic critical graphs (Q3096957) (← links)
- Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5 (Q3174244) (← links)
- Facial rainbow edge-coloring of simple 3-connected plane graphs (Q3298111) (← links)
- The size of edge chromatic critical graphs with maximum degree 6 (Q3605165) (← links)
- Coloring 3-power of 3-subdivision of subcubic graph (Q4554572) (← links)
- (2,1)-total labelling of planar graphs with large maximum degree (Q5069984) (← links)
- REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4 (Q5076249) (← links)
- Recent progress on strong edge-coloring of graphs (Q5242836) (← links)
- A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture (Q5325954) (← links)
- Chromatic index, treewidth and maximum degree (Q5892299) (← links)
- Chromatic index, treewidth and maximum degree (Q5916063) (← links)
- Signed planar graphs with \(\Delta \geq 8\) are \(\Delta\)-edge-colorable (Q6041542) (← links)
- On the maximum number of edges in planar graphs of bounded degree and matching number (Q6041557) (← links)
- The average degree of edge chromatic critical graphs with maximum degree seven (Q6074595) (← links)
- Partitioning edges of a planar graph into linear forests and a matching (Q6081582) (← links)
- Weakening total coloring conjecture and Hadwiger's conjecture on total graphs (Q6117407) (← links)
- (Q6177586) (← links)