A note on the Hadwiger number of circular arc graphs
From MaRDI portal
Publication:2379986
DOI10.1016/J.IPL.2007.04.008zbMATH Open1183.05028OpenAlexW2071338764MaRDI QIDQ2379986FDOQ2379986
L. Sunil Chandran, N. S. Narayanaswamy, Naveen Sivadasan, Naveen Belkale
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.04.008
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)
Cites Work
Cited In (7)
- The number of arcs of a strongly connected oriented graph with two noncritical vertices
- Hadwiger's conjecture for proper circular arc graphs
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- On defining numbers of circular complete graphs
- On the hyperbolicity constant of circular-arc graphs
- On the Circular Area Signature for Graphs
- Circular-arc hypergraphs: rigidity via connectedness
Recommendations
- Hadwiger's conjecture for proper circular arc graphs 👍 👎
- On some subclasses of circular-arc graphs 👍 👎
- Title not available (Why is that?) 👍 👎
- Dominating sets and domatic number of circular arc graphs 👍 👎
- On cliques of Helly Circular-arc Graphs 👍 👎
- Circular-arc graphs with clique cover number two 👍 👎
- On the hyperbolicity constant of circular-arc graphs 👍 👎
- Title not available (Why is that?) 👍 👎
- Partial characterizations of circular-arc graphs 👍 👎
- Partial Characterizations of Circular-Arc Graphs 👍 👎
This page was built for publication: A note on the Hadwiger number of circular arc graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379986)
