On path factors of \((3,4)\)-biregular bigraphs

DOI10.1007/s00373-008-0803-yzbMath1177.05089arXiv0706.1740MaRDI QIDQ1014829

Carl Johan Casselgren, Armen S. Asratian

Publication date: 29 April 2009

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

Full work available at URL: https://arxiv.org/abs/0706.1740

zbMATH Keywords

interval edge coloring; path factor; biregular bipartite graph

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C38: Paths and cycles

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compact scheduling of zero-one time operations in multi-stage systems
• Graph factors and factorization: 1985--2003: a survey
• On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs
• Investigation on interval edge-colorings of graphs
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs
• Proper path‐factors and interval edge‐coloring of (3,4)‐biregular bigraphs
• Path factors in cubic graphs
• Factors and factorizations of graphs—a survey
• Path factors of bipartite graphs
• Path factors in claw-free graphs