Pages that link to "Item:Q697075"

The following pages link to Planar graphs without cycles of specific lengths (Q697075):

Displaying 41 items.

• A sufficient condition for a planar graph to be 4-choosable (Q526822) (← links)
• Planar graphs without 4-cycles adjacent to triangles are 4-choosable (Q738863) (← links)
• On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability (Q854811) (← links)
• Choosability in signed planar graphs (Q896077) (← links)
• On 3-choosability of planar graphs without certain cycles (Q963411) (← links)
• Equitable list coloring of planar graphs without 4- and 6-cycles (Q998523) (← links)
• Vertex arboricity of planar graphs without intersecting 5-cycles (Q1702820) (← links)
• Planar graphs without chordal 6-cycles are 4-choosable (Q1752596) (← links)
• A sufficient condition for DP-4-colorability (Q1752670) (← links)
• Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate (Q1981692) (← links)
• The 4-choosability of planar graphs and cycle adjacency (Q1981715) (← links)
• Planar graphs without specific cycles are 2-degenerate (Q2037563) (← links)
• Cycle spectra of contraction-critically 4-connected planar graphs (Q2053680) (← links)
• Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable (Q2078245) (← links)
• On weak flexibility in planar graphs (Q2093108) (← links)
• Distribution of subtree sums (Q2107487) (← links)
• Two sufficient conditions for a planar graph to be list vertex-2-arborable (Q2124649) (← links)
• Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate (Q2144489) (← links)
• On the structure of essentially-highly-connected polyhedral graphs (Q2172412) (← links)
• Planar graphs without 7-cycles and butterflies are DP-4-colorable (Q2185894) (← links)
• DP-4-colorability of planar graphs without adjacent cycles of given length (Q2306602) (← links)
• DP-4-colorability of two classes of planar graphs (Q2324485) (← links)
• Planar graphs without intersecting 5-cycles are 4-choosable (Q2397522) (← links)
• \((4,2)\)-choosability of planar graphs with forbidden structures (Q2409516) (← links)
• On the vertex-arboricity of planar graphs (Q2427551) (← links)
• On planar graphs arbitrarily decomposable into closed trails (Q2482349) (← links)
• Some sufficient conditions for a planar graph of maximum degree six to be Class 1 (Q2497482) (← links)
• Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles (Q2680856) (← links)
• 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz (Q2685332) (← links)
• Vertex arboricity of planar graphs without chordal 6-cycles (Q2868169) (← links)
• Choosability of toroidal graphs without short cycles (Q3055923) (← links)
• LIST POINT ARBORICITY OF GRAPHS (Q3166733) (← links)
• (Q5197596) (← links)
• Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic (Q5859490) (← links)
• Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus (Q5875873) (← links)
• Find subtrees of specified weight and cycles of specified length in linear time (Q6056757) (← links)
• 3‐Degenerate induced subgraph of a planar graph (Q6056810) (← links)
• Separating signatures in signed planar graphs (Q6110620) (← links)
• Weak degeneracy of planar graphs without 4- and 6-cycles (Q6157423) (← links)
• A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles (Q6173908) (← links)
• Light 3-paths in 3-polytopes without adjacent triangles (Q6203328) (← links)