Compatible spanning circuits and forbidden induced subgraphs

DOI10.1007/S00373-023-02735-8MaRDI QIDQ6184989zbMATH OpenOpenAlexFDO

Authors Zhiwei Guo, Christoph Brause, Maximilian Geißer, Ingo Schiermeyer

Publication date 29 January 2024

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00373-023-02735-8

zbMATH Keywords

compatible spanning circuitedge-colored graphforbidden subgraphHamiltonian graphsupereulerian graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Compatible spanning circuits in edge-colored graphs
• Almost Eulerian compatible spanning circuits in edge-colored graphs
• Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
• Eulerian Circuits with No Monochromatic Transitions in Edge-colored Digraphs
• Sufficient conditions for the existence of spanning colored trees in edge-colored graphs

Cites work

• A note on graphs spanned by Eulerian graphs
• A note on Hamiltonian circuits
• A Note on Sub-Eulerian Graphs
• A reduction method to find spanning Eulerian subgraphs
• Almost Eulerian compatible spanning circuits in edge-colored graphs
• Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems
• Compatible spanning circuits in edge-colored graphs
• Forbidden pairs for spanning (closed) trails
• Forbidden set of induced subgraphs for 2-connected supereulerian graphs
• Forbidden triples for Hamiltonicity
• Graph theory
• Hamilton cycles in 5-connected line graphs
• Hamilton cycles in claw-free graphs
• Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results
• Hamiltonian results inK1,3-free graphs
• Hamiltonicity and minimum degree in 3-connected claw-free graphs
• Hamiltonicity of digraphs for universal cycles of permutations
• scientific article; zbMATH DE number 1185308 (Why is no real title available?)
• scientific article; zbMATH DE number 15867 (Why is no real title available?)
• scientific article; zbMATH DE number 1557065 (Why is no real title available?)
• scientific article; zbMATH DE number 3249675 (Why is no real title available?)
• On a closure concept in claw-free graphs
• Properly coloured Hamiltonian cycles in edge-coloured complete graphs
• Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
• Sufficient conditions for a digraph to be supereulerian
• Supereulerian graphs: A survey
• The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
• The orderly colored longest path problem -- a survey of applications and new algorithms

This page was built for publication: Compatible spanning circuits and forbidden induced subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184989)