scientific article; zbMATH DE number 3494318
From MaRDI portal
Publication:4075398
Cited in
(19)- Even cycles in directed graphs
- Parite des cycles contenant des sommets specifies d'un graphe
- Circuits through specified edges
- On general dissections of a polygon
- Simultaneous coloring of edges and faces of plane graphs
- Vertex-pancyclicity of edge-face-total graphs
- 7-connected graphs are 4-ordered
- The edge-face choosability of plane graphs with maximum degree at least 9
- Removable cycles in non-bipartite graphs
- Removable paths and cycles with parity constraints
- Bonds with parity constraints
- Independent paths and \(K_{5}\)-subdivisions
- Simultaneous coloring of vertices and incidences of outerplanar graphs
- Entire colouring of plane graphs
- An improved upper bound on the edge-face coloring of 2-connected plane graphs
- Linkages and removable paths avoiding vertices
- Connectivity keeping paths containing prescribed vertices in highly connected triangle-free graphs
- Plane graphs with maximum degree 6 are edge-face 8-colorable
- The Kelmans-Seymour conjecture. IV: A proof
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4075398)
